On the spectral characterization of some unicyclic graphs

نویسندگان

  • Xiaogang Liu
  • Suijie Wang
  • Yuanping Zhang
  • Xuerong Yong
چکیده

Let H(n; q, n1, n2) be a graph with n vertices containing a cycle Cq and two hanging paths Pn1 and Pn2 attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12; 6, 1, 5) and H(12; 8, 2, 2), no two non-isomorphic graphs of the form H(n; q, n1, n2) are A-cospectral. It is proved that all graphs H(n; q, n1, n2) are determined by their L-spectra. And all graphs H(n; q, n1, n2) are proved to be determined by theirQ -spectra, except for graphsH(2a+4; a+3, a 2 , a 2 +1)with a being a positive even number and H(2b; b, b 2 , b 2 ) with b ≥ 4 being an even number. Moreover, the Q -cospectral graphs with these two exceptions are given. © 2011 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Eccentric Connectivity Index of Unicyclic Graphs

In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.

متن کامل

Some results on the ordering of the Laplacian spectral radii of unicyclic graphs

A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131–135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend th...

متن کامل

Some results on the spectral radii of trees, unicyclic and bicyclic graphs

Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...

متن کامل

Ela Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs

Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

On reverse degree distance of unicyclic graphs

The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 311  شماره 

صفحات  -

تاریخ انتشار 2011